The Evaluation of Data Distributions for Multi-Dimensional Sparse Arrays Based on the EKMR Scheme
نویسندگان
چکیده
In our previous work, we have studied the performance of three data distribution schemes, Send Followed Compress (SFC), Compress Followed Send (CFS), and Encoding-Decoding (ED), for sparse arrays based on the traditional matrix representation (TMR) scheme. Since multi-dimensional arrays can also be represented by the extended Karnaugh map representation (EKMR) scheme, in this paper, we first apply the SFC, the CFS, and the ED schemes for multi-dimensional sparse arrays based on the EKMR scheme. Then, we compare the performance of these three schemes based on the EKMR scheme with those based on the TMR scheme. Both theoretical analysis and experimental test were conducted. In theoretical analysis, we analyze the SFC, the CFS, and the ED schemes based on the TMR and the EKMR schemes in terms of the data distribution time and the data compression time. In experimental test, we implemented these three schemes based on the TMR and the EKMR schemes on an IBM SP2 parallel machine. From the experimental results, the ED scheme outperforms the CFS scheme that outperforms the SFC scheme for most of test sparse arrays. The SFC, the CFS, and the ED schemes based on the EKMR scheme outperform those based on the TMR scheme, respectively.
منابع مشابه
A New Approach for Representation of Multi-dimensional Matrix Multiplication Operations
In this paper, the extended Karnaugh Map representation (EKMR) scheme has been proposed as an alternative to the traditional matrix representation (TMR) which caused the multi-dimensional array operation to be inefficient when extended to dimensions higher than two. Multi-dimensional arrays are widely used in a lot of scientific studies but still some issues have been encountered regarding effi...
متن کاملEfficient Data Compression Methods for Multi-Dimensional Sparse Array Operations
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage (CRS/CCS) schemes are the two common used data compression schemes for sparse arrays in the traditional matrix representation (TMR). When extended to higher dimensional sparse arrays, array operations used the CRS/CCS...
متن کاملEfficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme
In our previous work, we have proposed the extended Karnaugh map representation (EKMR) scheme for multidimensional array representation. In this paper, we propose two data compression schemes, EKMR Compressed Row/ Column Storage (ECRS/ECCS), for multidimensional sparse arrays based on the EKMR scheme. To evaluate the proposed schemes, we compare them to the CRS/CCS schemes. Both theoretical ana...
متن کاملEfficient Representation Scheme for Multidimensional Array Operations
ÐArray operations are used in a large number of important scientific codes, such as molecular dynamics, finite element methods, climate modeling, etc. To implement these array operations efficiently, many methods have been proposed in the literature. However, the majority of these methods are focused on the two-dimensional arrays. When extended to higher dimensional arrays, these methods usuall...
متن کاملEfficient Data Parallel Algorithms for Multidimensional Array Operations Based on the EKMR Scheme for Distributed Memory Multicomputers
Array operations are useful in a large number of important scientific codes, such as molecular dynamics, finite element methods, climate modeling, atmosphere and ocean sciences, etc. In our previous work, we have proposed a scheme extended Karnaugh map representation (EKMR) for multidimensional array representation. We have shown that sequential multidimensional array operation algorithms based...
متن کامل